Minimality of EDF networks with resource sharing
نویسندگان
چکیده
منابع مشابه
Resource Division Policies for EDF Scheduling in ATM Networks
The paper addresses the issue of reserving resources at ATM switches along the path of calls requiring a deterministic bound on end-to-end delay. The switches are assumed to schedule outgoing cells using the EarliestDeadline -First (EDF) scheduling discipline. EDF is known to be an optimal scheduling discipline when providing delay bounds to a number of calls being served by a single scheduler....
متن کاملResource - Sharing Computer Communications Networks
communications,” presented at the Ass. Comput. Mach. Symp. Operating Systems, Gatlinburg, Tenn., 1967. [45] -, “A forward look,” Signal, vol. 25, pp. 77-81, Aug. 1971. 1461 -, ‘Resource sharing networks,’ presented at the IEEE Int. Conv., New York, N. Y., Mar. 1969. [47] L. G. Roberts and B. Wessler, “The ARP.4 computer network development to achieve resource sharing, in Spring Joint Compztfer
متن کاملArchitectural Elements of Resource Sharing Networks
Since the formulation of the early ideas on meta-computing (Smarr & Catlett, 1992), several research activities have focused on mechanisms to connect worldwide distributed resources. Advances in distributed computing have enabled the creation of Grid-based resource sharing networks such as TeraGrid (Catlett, Beckman, Skow, & Foster, 2006) and Open Science Grid (2005). These networks, composed o...
متن کاملStability of Processor Sharing Networks with Simultaneous Resource Requirements
We study the phenomenon of entrainment in processor sharing networks, whereby, while individual network resources have sufficient capacity tomeet demand, the requirement for simultaneous availability of resourcesmeans that a networkmay nevertheless be unstable. We show that instability occurs through poor control, and that, for a variety of network topologies, only small modifications to contro...
متن کاملDynamic Competitive Resource Sharing in Multimedia Networks
Abstract: In this paper, we develop a methodology for dynamic resource sharing in multimedia networks with competing traffic types. We introduce dynamic queueing models for multimedia traffic types, as well as approximate linearized dynamic queueing models. We formulate the problem as an dynamic non-cooperative Nash game and state the conditions for non-cooperative equilibrium. Finally, we prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods of Operations Research
سال: 2016
ISSN: 1432-2994,1432-5217
DOI: 10.1007/s00186-016-0543-3